Abstract:

A novel method to construct regular or near-regular Low-density parity-check codes from prime fields is proposed. The low-density parity-check codes constructed by the proposed method have a good structure. Compared the simulation results with those of the widely researched array codes as LDPC codes, it is shown that these Low-density parity-check codes perform well with iterative decoding.

Key words: low-density parity-check (LDPC) code;parity-check matrix, prime field;primitive element